Asynchronous gossip principal components analysis
نویسندگان
چکیده
منابع مشابه
Asynchronous gossip principal components analysis
This paper deals with Principal Components Analysis (PCA) of data spread over a network where central coordination and synchronous communication between networking nodes are forbidden. We propose an asynchronous and decentralized PCA algorithm dedicated to large scale problems, where ”large” simultaneously applies to dimensionality, number of observations and network size. It is based on the in...
متن کاملPersian Handwriting Analysis Using Functional Principal Components
Principal components analysis is a well-known statistical method in dealing with large dependent data sets. It is also used in functional data for both purposes of data reduction as well as variation representation. On the other hand "handwriting" is one of the objects, studied in various statistical fields like pattern recognition and shape analysis. Considering time as the argument,...
متن کاملOnline Principal Components Analysis
We consider the online version of the well known Principal Component Analysis (PCA) problem. In standard PCA, the input to the problem is a set of ddimensional vectors X = [x1, . . . ,xn] and a target dimension k < d; the output is a set of k-dimensional vectors Y = [y1, . . . ,yn] that minimize the reconstruction error: minΦ ∑ i ‖xi − Φyi‖2. Here, Φ ∈ Rd×k is restricted to being isometric. The...
متن کاملPrincipal Components Analysis
Derivation of PCA I: For a set of d-dimensional data vectors {x}i=1, the principal axes {e}qj=1 are those orthonormal axes onto which the retained variance under projection is maximal. It can be shown that the vectors ej are given by the q dominant eigenvectors of the sample covariance matrix S, such that Sej = λjej . The q principal components of the observed vector xi are given by the vector ...
متن کاملRecursive Principal Components Analysis
Principal components analysis is an important and well-studied subject in statistics and signal processing. The literature has an abundance of algorithms for solving this problem, where most of these algorithms could be grouped into one of the following three approaches: adaptation based on Hebbian updates and deflation, optimization of a second order statistical criterion (like reconstruction ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2015
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2014.11.076